An independent axiomatization for free short-circuit logic

نویسندگان

  • Alban Ponse
  • Daan J. C. Staudt
چکیده

Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is evaluated only if the first argument does not suffice to determine the value of the expression. Free short-circuit logic is the equational logic in which compound statements are evaluated from left to right, while atomic evaluations are not memorized throughout the evaluation, i.e., evaluations of distinct occurrences of an atom in a compound statement may yield different truth values. We provide a simple semantics for free SCL and an independent axiomatization. Finally, we discuss evaluation strategies, some other SCLs, and side effects.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Genetic Based Methods for Optimizing the Reversible and Quantum Logic Circuits

Various synthesis methods have been proposed in the literature for reversible and quantum logic circuits. However, there are few algorithms to optimize an existing circuit with multiple constraints simultaneously. In this paper, some heuristics in genetic algorithms (GA) to optimize a given circuit in terms of quantum cost, number of gates, location of garbage outputs, and delay, are proposed. ...

متن کامل

Efficient Genetic Based Methods for Optimizing the Reversible and Quantum Logic Circuits

Various synthesis methods have been proposed in the literature for reversible and quantum logic circuits. However, there are few algorithms to optimize an existing circuit with multiple constraints simultaneously. In this paper, some heuristics in genetic algorithms (GA) to optimize a given circuit in terms of quantum cost, number of gates, location of garbage outputs, and delay, are proposed. ...

متن کامل

Simple axiomatization of reticulations on residuated lattices

‎We give a simple and independent axiomatization of reticulations on residuated lattices‎, ‎which were axiomatized by five conditions in [C‎. ‎Mureşan‎, ‎The reticulation of a residuated lattice‎, ‎Bull‎. ‎Math‎. ‎Soc‎. ‎Sci‎. ‎Math‎. ‎Roumanie‎ ‎51 (2008)‎, ‎no‎. ‎1‎, ‎47--65]‎. ‎Moreover‎, ‎we show that reticulations can be considered as lattice homomorphisms between residuated lattices and b...

متن کامل

A Sound and Complete Axiomatization of Majority-n Logic

Manipulating logic functions via majority operators recently drew the attention of researchers in computer science. For example, circuit optimization based on majority operators enables superior results as compared to traditional synthesis tools. Also, the Boolean satisfiability problem finds new solution approaches when described in terms of majority decisions. To support computer logic applic...

متن کامل

A Constructive Conditional Logic for Access Control

We define an Intuitionistic Conditional Logic for Access Control called CICL . The logic CICL is based on a conditional language allowing principals to be defined as arbitrary formulas and it includes few uncontroversial axioms of access control logics. We provide an axiomatization and a Kripke model semantics for the logic CICL , prove that the axiomatization is sound and complete with respect...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1707.05718  شماره 

صفحات  -

تاریخ انتشار 2017